Minimum degree of 3-graphs without long linear paths
نویسندگان
چکیده
منابع مشابه
Connected graphs without long paths
A problem, first considered by Erdős and Gallai [2], was to determine the maximum number of edges in any graph on n vertices if it contains no path with k + 1 vertices. This maximum number, ext(n, Pk+1), is called the extremal number for the path Pk+1. Erdős and Gallai proved the following theorem, which was one of the earliest extremal results in graph theory. Theorem 1.1 ([2]). For every k ≥ ...
متن کاملLong paths and cycles in random subgraphs of graphs with large minimum degree
For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G obtained by taking each edge independently with probability p. We prove that (i) if p ≥ ω/k for a function ω = ω(k) that tends to infinity as k does, then Gp asymptotically almost surely contains a cycle (and thus a path) of length at least (1− o(1))k, and (ii) if p ≥ (1 + o(1)) ln k/k, then Gp asymptotica...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملApproximately Coloring Graphs Without Long Induced Paths
It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable graph without an induced path on t vertices, computes a coloring with max { 5, 2 ⌈ t−1 2 ⌉ − 2 } many colors. If the input graph is triangle-free, we only need max { 4, ⌈ t−1...
متن کاملMinimum Degree and Dominating Paths
A dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. A result of Broersma from 1988 implies that if G is an n-vertex k-connected graph and δ(G) > n−k k+2 − 1, then G contains a dominating path. We prove the following results. The lengths of dominating paths include all values from the shortest up to at least min{n − 1,2δ(G)}. For δ(G) > an, where a is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111949